Robustness of scale-free spatial networks
نویسندگان
چکیده
منابع مشابه
Robustness of Scale-free Spatial Networks
A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the d-dimensional torus and are connected to existing vertices with a probability favouring short spatial distances and high degrees. In this model of a scale-free...
متن کاملEnhancing the robustness of scale-free networks
Error tolerance and attack vulnerability are two common and important properties of complex networks, which are usually used to evaluate the robustness of a network. Recently, much work has been devoted to determining the network design with optimal robustness. However, little attention has been paid to the problem of how to improve the robustness of existing networks. In this paper, we present...
متن کاملScale-Free Networks and Robustness of Critical Infrastructure Networks
We examine the robustness of critical infrastructure networks, specifically aspects which relate to the network topology. We describe some simulation studies which identify a number of characteristics that make a network robust in the face of terrorist attacks, taking link capacity into account. Our simulations utilise a network analysis package called CAVALIER, which we have developed. Our res...
متن کاملImproving Robustness of Scale-Free Networks to Message Distortion
Vast numbers of organizations and individuals communicate every day by sending messages over social networks. These messages, however, are subject to change as they propagate through the network. This paper attempts to calculate the distortion of a message as it propagates in a social network with a scale free topology, and to establish a remedial process in which a node will correct the distor...
متن کاملEntropy Optimization of Scale-Free Networks Robustness to Random Failures
Many networks are characterized by highly heterogeneous distributions of links, which are called scale-free networks and the degree distributions follow p(k) ∼ ck−α. We study the robustness of scale-free networks to random failures from the character of their heterogeneity. Entropy of the degree distribution can be an average measure of a network’s heterogeneity. Optimization of scale-free netw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2017
ISSN: 0091-1798
DOI: 10.1214/16-aop1098